Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
نویسندگان
چکیده
The notion of a meaningless set has been defined for infinitary lambda calculus axiomatically. Standard examples of meaningless sets are sets of terms that have no head normal form, the set of terms without weak head normal form and the set of rootactive terms. The collection of meaningless sets is a lattice. In this paper, we study the way this lattices decompose as union of more elementary key intervals. We also analyse the distribution of the sets of meaningless terms in the lattice by selecting some sets as key vertices and study the cardinality in the intervals between key vertices. As an application, we prove that the lattice of meaningless sets is neither distributive nor modular. Interestingly, the example translates into a counterexample that the lattice of lambda theories is not modular.
منابع مشابه
Weakening the Axiom of Overlap in Infinitary Lambda Calculus
In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So far only a set of sufficient conditions was known for choosing a suitable set of meaningless terms to make this construction produce confluent extensions. The conditions covered the three main known examp...
متن کاملOn Undefined and Meaningless in Lambda Definability
We distinguish between undefined terms as used in lambda definability of partial recursive functions and meaningless terms as used in infinite lambda calculus for the infinitary terms models that generalise the Böhm model. While there are uncountable many known sets of meaningless terms, there are four known sets of undefined terms. Two of these four are sets of meaningless terms. In this paper...
متن کاملMeaningless Sets in Infinitary Combinatory Logic
In this paper we study meaningless sets in infinitary combinatory logic. So far only a handful of meaningless sets were known. We show that there are uncountably many meaningless sets. As an application to the semantics of finite combinatory logics, we show that there exist uncountably many combinatory algebras that are not a lambda algebra. We also study ways of weakening the axioms of meaning...
متن کاملBöhm Reduction in Infinitary Term Graph Rewriting Systems
The confluence properties of lambda calculus and orthogonal term rewriting do not generalise to the corresponding infinitary calculi. In order to recover the confluence property in a meaningful way, Kennaway et al. [11, 10] introduced Böhm reduction, which extends the ordinary reduction relation so that ‘meaningless terms’ can be contracted to a fresh constant ⊥. In previous work, we have estab...
متن کاملAn Alpha-Corecursion Principle for the Infinitary Lambda Calculus
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a certain endofunctor on the category of nominal sets. We show that the terms of the infinitary lambda-calculus form the final coalgebra for the same functor. This allows us to give a corecursion principle for alpha-equivalence classes of finite and infinite terms. As an application, we give corec...
متن کامل